/*
 * Copyright (C) 2010 Graham Allan
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

package edu.strath.cis.grallan.findbugs.adaptiveranking.util;

import java.util.List;
import java.util.concurrent.CopyOnWriteArrayList;

import edu.strath.cis.grallan.findbugs.adaptiveranking.RankingProgressCallback;

public class RankingProgressNotifier {
	private List<RankingProgressCallback> progressCallbacks = new CopyOnWriteArrayList<RankingProgressCallback>();

	public boolean addRankProgressCallback(RankingProgressCallback toAdd) {
		return progressCallbacks.add(toAdd);
	}

	public boolean removeRankProgressCallback(RankingProgressCallback toRemove) {
		return progressCallbacks.remove(toRemove);
	}

	public void doNotifyComputationStarted(int numberOfBugs) {
		for (RankingProgressCallback callback : progressCallbacks) {
			callback.notifyRankingStarted(numberOfBugs);
		}
	}

	public void doNotifyValueComputed() {
		for (RankingProgressCallback callback : progressCallbacks) {
			callback.notifySingleRankComputed();
		}
	}

	public void doNotifyRankingComputed() {
		for (RankingProgressCallback callback : progressCallbacks) {
			callback.notifyRankingComputed();
		}
	}

	public void doNotifyRefreshCompleted() {
		for (RankingProgressCallback callback : progressCallbacks) {
			callback.notifyRefreshComplete();
		}
	}
}